A recurrence scheme for least-square optimized polynomials
نویسنده
چکیده
A recurrence scheme is defined for the numerical determination of high degree polynomial approximations to functions as, for instance, inverse powers near zero. As an example, polynomials needed in the two-step multi-boson (TSMB) algorithm for fermion simulations are considered. For the polynomials needed in TSMB a code in C is provided which is easily applicable to polynomial degrees of several thousands.
منابع مشابه
Least-squares optimized polynomials for fermion simulations
Least-squares optimized polynomials are discussed which are needed in the twostep multi-bosonic algorithm for Monte Carlo simulations of quantum field theories with fermions. A recurrence scheme for the calculation of necessary coefficients in the recursion and for the evaluation of these polynomials is introduced.
متن کاملDESY 99-170 Least-squares optimized polynomials for fermion simulations∗
Least-squares optimized polynomials are discussed which are needed in the twostep multi-bosonic algorithm for Monte Carlo simulations of quantum field theories with fermions. A recurrence scheme for the calculation of necessary coefficients in the recursion and for the evaluation of these polynomials is introduced.
متن کاملOrthogonal polyanalytic polynomials and normal matrices
The Hermitian Lanczos method for Hermitian matrices has a wellknown connection with a 3-term recurrence for polynomials orthogonal on a discrete subset of R. This connection disappears for normal matrices with the Arnoldi method. In this paper we consider an iterative method that is more faithful to the normality than the Arnoldi iteration. The approach is based on enlarging the set of polynomi...
متن کاملAdditional Recursion Relations, Factorizations, and Diophantine Properties Associated with the Polynomials of the Askey Scheme
In this paper, we apply to almost all the “named” polynomials of the Askey scheme, as defined by their standard three-term recursion relations, the machinery developed in previous papers. For each of these polynomials we identify at least one additional recursion relation involving a shift in some of the parameters they feature, and for several of these polynomials characterized by special valu...
متن کاملOn the Characteristic and Permanent Polynomials of a Matrix
There is a digraph corresponding to every square matrix over C. We generate a recurrence relation using the Laplace expansion to calculate the characteristic, and permanent polynomials of a square matrix. Solving this recurrence relation, we found that the characteristic, and permanent polynomials can be calculated in terms of characteristic, and permanent polynomials of some specific induced s...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2003